LZW Text Compression in Haskell
نویسندگان
چکیده
Functional programming is largely untested in the industrial environment. This paper summarises the results of a study into the suitability of Haskell in the area of text compression, an area with deenite commercial interest. Our program initially performs very poorly in comparison with a version written in C. Experiments reveal the cause of this to be the large disparity in the relative speed of I/O and bit{level operations and also a space leak inherent in the Haskell deenition.
منابع مشابه
New LZW Data Compression Algorithm and Its FPGA Implementation
This paper presents a new LZW data compression algorithm that partitions conventional single large dictionary into a dictionary set that consists of several small address space dictionaries. As doing so the dictionary set not only has small lookup time but also can operate in parallel. Simulation results show that the proposed algorithm has better compression ratio for image data than conventio...
متن کاملLZW Compressed Text Classification using Nearest Neighbor Classifier
Internet is a pool of information, which contains billions of text documents which are stored in compressed format. In literature we can find many text classification algorithms which work on uncompressed text documents. In this paper, we propose a novel representation scheme for a given text document using compression technique. Further, proposed representation scheme is used to develop a meth...
متن کاملSelf-adapting Radar Video Echo Acquisition System based on LZW Algorithm
This paper presents a high-speed low-complexity Field Program Gate Array (FPGA) design and implementation of the lossless Lempel-Ziv-Welch (LZW) algorithm on Xilinx Virtex-E device family for selfadapting Radar video echo data acquisition Applications. A multi-channel self-adaptive variable sampling rate data acquisition system based on FPGA and I2C bus is introduced. By writing the frame data ...
متن کاملA Tree Based Binary Encoding of Text Using LZW Algorithm
The most popular adaptive dictionary coding scheme used for text compression is the LZW algorithm [2]. In the LZW algorithm, a changing dictionary contains common strings that have been encountered so far in t,he text. The dictionary can be represented by a dynamic trie. The input text is examined character by character and the longest substring (called a prefix string) of the text which alread...
متن کاملDesign Consideration for Multi-lingual Cascading Text Compressors
In this paper, we studied the cascading of LZ variants to Huffman coding for multilingual documents. Two models are proposed: the static model and the adaptive (dynamic) model. The static model makes use of the dictionary generated by the LZW algorithm in the Chinese dictionary based Huffman compression to achieve better performance. The dynamic model is an extension of the static cascading mod...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1992